Abstract—We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An achievable region is given for the twouser two-layer case and it provides the complete rate-distortion region for the Gaussian source under the MSE distortion measure. The key observation is that this problem includes the multiple description (MD) problem (with two descriptions) as a subsystem, and the techniques useful in the MD problem can be extended to this case. It is shown that the coding scheme based on the universality of random binning is sub-optimal, because multiple Gaussian side informatio...
The problem of successive refinement in distributed source coding and in joint source-channel coding...
Abstract—Multiple description coding, in general, requires separate codebooks for each description. ...
In this paper, new upper and lower bounds are first presented for the rate loss of multiple descript...
Abstract—In this correspondence, we consider the multiuser successive refinement (MSR) problem, wher...
In this correspondence, we show that solutions to the multiple description coding problem and the br...
Abstract—A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievab...
Abstract—A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievab...
Abslruct-The successive refinement of information consists of first approximating data using a few h...
We consider multiple description coding for the Gaussian source with K descriptions under the symmet...
We consider a binary erasure version of the n-channel multiple descriptions problem with symmetric d...
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the s...
Abstract—This paper focuses on a new framework for scalable coding of information based on principle...
Multiple description (MD) coding is a source coding technique for information transmission over unre...
This paper considers the transmission of multiple descriptions over noisy channels rather than the o...
The successive refinement problem is extended to vector sources where individual distortion constrai...
The problem of successive refinement in distributed source coding and in joint source-channel coding...
Abstract—Multiple description coding, in general, requires separate codebooks for each description. ...
In this paper, new upper and lower bounds are first presented for the rate loss of multiple descript...
Abstract—In this correspondence, we consider the multiuser successive refinement (MSR) problem, wher...
In this correspondence, we show that solutions to the multiple description coding problem and the br...
Abstract—A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievab...
Abstract—A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievab...
Abslruct-The successive refinement of information consists of first approximating data using a few h...
We consider multiple description coding for the Gaussian source with K descriptions under the symmet...
We consider a binary erasure version of the n-channel multiple descriptions problem with symmetric d...
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the s...
Abstract—This paper focuses on a new framework for scalable coding of information based on principle...
Multiple description (MD) coding is a source coding technique for information transmission over unre...
This paper considers the transmission of multiple descriptions over noisy channels rather than the o...
The successive refinement problem is extended to vector sources where individual distortion constrai...
The problem of successive refinement in distributed source coding and in joint source-channel coding...
Abstract—Multiple description coding, in general, requires separate codebooks for each description. ...
In this paper, new upper and lower bounds are first presented for the rate loss of multiple descript...